Optimizing Matrix Stability
نویسندگان
چکیده
Given an affine subspace of square matrices, we consider the problem of minimizing the spectral abscissa (the largest real part of an eigenvalue). We give an example whose optimal solution has Jordan form consisting of a single Jordan block, and we show, using nonlipschitz variational analysis, that this behaviour persists under arbitrary small perturbations to the example. Thus although matrices with nontrivial Jordan structure are rare in the space of all matrices, they appear naturally in spectral abscissa minimization.
منابع مشابه
A Stable and Efficient Loop Tiling Algorithm
Loop tiling is an effective optimizing transformation to boost the memory performance of a program, especially for dense matrix scientific computations. The magnitude and stability of the achieved performance improvements is heavily dependent on the appropriate selection of tile sizes. Many existing tile selection algorithms try to find tile sizes which eliminate self-interference cache conflic...
متن کاملOn Psi-conditional asymptotic stability of first order nonlinear matrix Lyapunov system
We provide necessary and sucient conditions for psi-conditional as-ymptotic stability of the solution of a linear matrix Lyapunov system and sucientconditions for psi -conditional asymptotic stability of the solution of a rst ordernon-linear matrix Lyapunov system X0 = A(t)X + XB(t) + F(t;X).
متن کاملFuzzy Relational Matrix-Based Stability Analysis for First-Order Fuzzy Relational Dynamic Systems
In this paper, two sets of sufficient conditions are obtained to ensure the existence and stability of a unique equilibrium point of unforced first-order fuzzy relational dynamical systems by using two different approaches which are both based on the fuzzy relational matrix of the model.In the first approach, the equilibrium point of the system is one of the centers of the related membership fu...
متن کاملThe Implementation of BLAS level 3 on the AP 1000 - Preliminary
The Basic Linear Algebra Subprogram (BLAS) library is widely used in many super-computing applications, and is used to implement more extensive linear algebra subroutine libraries, such as LINPACK and LAPACK. To take advantage of the high degree of paral-lelism of architectures such as the Fujitsu AP1000, BLAS level 3 routines (matrix-matrix operations) are proposed. This project is concerned w...
متن کاملA stable iteration to the matrix inversion
The matrix inversion plays a signifcant role in engineering and sciences. Any nonsingular square matrix has a unique inverse which can readily be evaluated via numerical techniques such as direct methods, decomposition scheme, iterative methods, etc. In this research article, first of all an algorithm which has fourth order rate of convergency with conditional stability will be proposed. ...
متن کاملThe Implementation of BLAS level 3 on the AP 1000 : Preliminary Report ∗
The Basic Linear Algebra Subprogram (BLAS) library is widely used in many supercomputing applications, and is used to implement more extensive linear algebra subroutine libraries, such as LINPACK and LAPACK. To take advantage of the high degree of parallelism of architectures such as the Fujitsu AP1000, BLAS level 3 routines (matrix-matrix operations) are proposed. This project is concerned wit...
متن کامل